A POLYNOMIAL ALGORITHM ON COMPUTING LAG SPLINE
نویسندگان
چکیده
منابع مشابه
Fast L1kCk polynomial spline interpolation algorithm with shape-preserving properties
In this article, we address the interpolation problem of data points per regular L1spline polynomial curve that is invariant under a rotation of the data. We iteratively apply a minimization method on five data, belonging to a sliding window, in order to obtain this interpolating curve. We even show in the Ck-continuous interpolation case that this local minimization method preserves well the l...
متن کاملOn Positive and Copositive Polynomial and Spline
For a function f 2 L p ?1; 1], 0 < p < 1, with nitely many sign changes, we construct a sequence of polynomials P n 2 n which are copositive with f and such that kf ? P n k p C! ' (f; (n + 1) ?1) p , where ! ' (f; t) p denotes the Ditzian-Totik modulus of continuity in L p metric. It was shown by S. P. Zhou that this estimate is exact in the sense that if f has at least one sign change, then ! ...
متن کاملA polynomial - time algorithm for computing a shortest path
In this paper, we consider the problem of computing a shortest path of bounded curvature amidst obstacles in the plane. More precisely, given prescribed initial and nal conngurations (i.e. positions and orientations) and a set of obstacles in the plane, we want to compute a shortest C 1 path joining those two conngurations, avoiding the obstacles, and with the further constraint that, on each C...
متن کاملNON-POLYNOMIAL QUARTIC SPLINE SOLUTION OF BOUNDARY-VALUE PROBLEM
Quartic non-polynomial spline function approximation in off step points is developed, for the solution of fourth-order boundary value problems. Using consistency relation of such spline and suitable choice of parameter,we have obtained second, fourth and sixth orders methods. Convergence analysis of sixth order method has been given. The methods are illustrated by some examples, to verify the or...
متن کاملA polynomial-time algorithm for computing absolutely normal numbers
We give an algorithm to compute an absolutely normal number so that the first i digits in its binary expansion are obtained in time polynomial in i; in fact, just above quadratic. The algorithm uses combinatorial tools to control divergence from normality. Speed of computation is achieved at the sacrifice of speed of convergence to normality.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
سال: 1991
ISSN: 0373-6385
DOI: 10.2206/kyushumfs.45.309